Whitney’s extension problem for Cm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating CM: Problem Management

CM: Problem Management is a detailed problem management process model to be utilised within corrective maintenance. It has been developed at ABB and evaluated for its industrial relevance within 17 non-ABB organisations. In this paper, we present the evaluation results of CM: Problem Management. Our primary goal is to confirm its industrial relevance. Our secondary goal is to establish current ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Criteria for Bochner's extension problem

A necessary and sufficient condition for the resolution of the weak extension problem is given. This criterion is applied to also give a criterion for the solvability of the classical Bochner’s extension problem in the L–category. The solution of the L–extension problem by Bochner [1] giving the relation between the order of the operator, the dimension, and index p, for which the L–extension pr...

متن کامل

On the Extension Problem for Partial Permutations

A family of pseudovarieties of solvable groups is constructed, each of which has decidable membership and undecidable extension problem for partial permutations. Included are a pseudovariety U satisfying no non-trivial group identity and a metabelian pseudovariety Q. For each of these pseudovarieties V, the inverse monoid pseudovariety Sl∗V has undecidable membership problem. As a consequence, ...

متن کامل

On the Compositional Extension Problem

A semantics may be compositional and yet partial, in the sense that not all well-formed expressions are assigned meanings by it. Examples come from both natural and formal languages. When can such a semantics be extended to a total one, preserving compositionality? This sort of extension problem was formulated in Hodges [9], and solved there in a particular case, in which the total extension re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Mathematics

سال: 2006

ISSN: 0003-486X

DOI: 10.4007/annals.2006.164.313